Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

a1(c1(d1(x))) -> c1(x)
u1(b1(d1(d1(x)))) -> b1(x)
v1(a1(a1(x))) -> u1(v1(x))
v1(a1(c1(x))) -> u1(b1(d1(x)))
v1(c1(x)) -> b1(x)
w1(a1(a1(x))) -> u1(w1(x))
w1(a1(c1(x))) -> u1(b1(d1(x)))
w1(c1(x)) -> b1(x)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a1(c1(d1(x))) -> c1(x)
u1(b1(d1(d1(x)))) -> b1(x)
v1(a1(a1(x))) -> u1(v1(x))
v1(a1(c1(x))) -> u1(b1(d1(x)))
v1(c1(x)) -> b1(x)
w1(a1(a1(x))) -> u1(w1(x))
w1(a1(c1(x))) -> u1(b1(d1(x)))
w1(c1(x)) -> b1(x)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

V1(a1(c1(x))) -> U1(b1(d1(x)))
W1(a1(a1(x))) -> U1(w1(x))
V1(a1(a1(x))) -> V1(x)
V1(a1(a1(x))) -> U1(v1(x))
W1(a1(c1(x))) -> U1(b1(d1(x)))
W1(a1(a1(x))) -> W1(x)

The TRS R consists of the following rules:

a1(c1(d1(x))) -> c1(x)
u1(b1(d1(d1(x)))) -> b1(x)
v1(a1(a1(x))) -> u1(v1(x))
v1(a1(c1(x))) -> u1(b1(d1(x)))
v1(c1(x)) -> b1(x)
w1(a1(a1(x))) -> u1(w1(x))
w1(a1(c1(x))) -> u1(b1(d1(x)))
w1(c1(x)) -> b1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

V1(a1(c1(x))) -> U1(b1(d1(x)))
W1(a1(a1(x))) -> U1(w1(x))
V1(a1(a1(x))) -> V1(x)
V1(a1(a1(x))) -> U1(v1(x))
W1(a1(c1(x))) -> U1(b1(d1(x)))
W1(a1(a1(x))) -> W1(x)

The TRS R consists of the following rules:

a1(c1(d1(x))) -> c1(x)
u1(b1(d1(d1(x)))) -> b1(x)
v1(a1(a1(x))) -> u1(v1(x))
v1(a1(c1(x))) -> u1(b1(d1(x)))
v1(c1(x)) -> b1(x)
w1(a1(a1(x))) -> u1(w1(x))
w1(a1(c1(x))) -> u1(b1(d1(x)))
w1(c1(x)) -> b1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 4 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

W1(a1(a1(x))) -> W1(x)

The TRS R consists of the following rules:

a1(c1(d1(x))) -> c1(x)
u1(b1(d1(d1(x)))) -> b1(x)
v1(a1(a1(x))) -> u1(v1(x))
v1(a1(c1(x))) -> u1(b1(d1(x)))
v1(c1(x)) -> b1(x)
w1(a1(a1(x))) -> u1(w1(x))
w1(a1(c1(x))) -> u1(b1(d1(x)))
w1(c1(x)) -> b1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


W1(a1(a1(x))) -> W1(x)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( W1(x1) ) = max{0, x1 - 3}


POL( a1(x1) ) = x1 + 2



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

a1(c1(d1(x))) -> c1(x)
u1(b1(d1(d1(x)))) -> b1(x)
v1(a1(a1(x))) -> u1(v1(x))
v1(a1(c1(x))) -> u1(b1(d1(x)))
v1(c1(x)) -> b1(x)
w1(a1(a1(x))) -> u1(w1(x))
w1(a1(c1(x))) -> u1(b1(d1(x)))
w1(c1(x)) -> b1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

V1(a1(a1(x))) -> V1(x)

The TRS R consists of the following rules:

a1(c1(d1(x))) -> c1(x)
u1(b1(d1(d1(x)))) -> b1(x)
v1(a1(a1(x))) -> u1(v1(x))
v1(a1(c1(x))) -> u1(b1(d1(x)))
v1(c1(x)) -> b1(x)
w1(a1(a1(x))) -> u1(w1(x))
w1(a1(c1(x))) -> u1(b1(d1(x)))
w1(c1(x)) -> b1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


V1(a1(a1(x))) -> V1(x)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( V1(x1) ) = max{0, x1 - 3}


POL( a1(x1) ) = x1 + 2



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

a1(c1(d1(x))) -> c1(x)
u1(b1(d1(d1(x)))) -> b1(x)
v1(a1(a1(x))) -> u1(v1(x))
v1(a1(c1(x))) -> u1(b1(d1(x)))
v1(c1(x)) -> b1(x)
w1(a1(a1(x))) -> u1(w1(x))
w1(a1(c1(x))) -> u1(b1(d1(x)))
w1(c1(x)) -> b1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.